Design of Turbo Codes for Non-Equiprobable Memoryless Sour es

Turbo Codes for Binary Markov Sour es 1

Joint source-channel coding of binary sources with side information at the decoder using IRA codes

We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source ent...

Source Turbo Encoder Channel Sink Turbo Decoder BPSK

Abstra t | In this work, we investigate the joint sour ehannel oding issue of transmitting non-uniform independent and identi ally distributed (i.i.d.) sour es over additive white Gaussian noise (AWGN) hannels via Turbo odes. The sour e redundan y in the form of non-uniformity is exploited in the Turbo de oder via a modi ed extrinsi information. In ontrast to previous work, non-systemati re urs...

Nested convolutional/turbo codes for the binary Wyner-Ziv problem

We show how concatenated (convolutional) codes can be used to compress close to the Wyner-Ziv limit for binary sources. Focusing on the case of lossy compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on nested binary linear codes, which is the extension of Wyner’s lossless compression scheme to the lossy case proposed by Shamai, ...

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...